Quantification of Ultraprecision Surface Morphology using an Algebraic Graph Theoretic Approach

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Graph{Theoretic Approach to Surface Reconstruction

A new approach to the reconstruction of a surface from an unorganized set of points in space is presented. The point set may for example be obtained with a laser scanner or a manual digitizing tool, and is the only source of information about the shape of the acquired object. The basic idea is to calculate the euclidean minimum spanning tree (EMST) of the given points. The EMST is then augmente...

متن کامل

Prediction of surface roughness in ultraprecision turning using fuzzy logic

Ultraprecision turning is a manufacturing process used to generate a high surface roughness in precision components, and its input-output relationships are highly nonlinear. Surface roughness of a turned surface depends on the selection of cutting variables, such as cutting speed, feed and depth of cut. Realizing the fact that fuzzy logic controller (FLC) is a powerful tool for dealing with imp...

متن کامل

Selection of manufacturing process using graph theoretic approach

To manufacture a product, nowadays there are many methods available in the market to manufacture them and to earn more profits and best production which is the prime focus of any manufacturing industry, it is necessary to select only that type of manufacturing process which leads to more profits, less scraps, and reworks, faster production rate, good quality of production, employee satisfaction...

متن کامل

Prediction of viable circular permutants using a graph theoretic approach

MOTIVATION In recent years graph-theoretic descriptions have been applied to aid the analysis of a number of complex biological systems. However, such an approach has only just begun to be applied to examine protein structures and the network of interactions between residues with promising results. Here we examine whether a graph measure known as closeness is capable of predicting regions where...

متن کامل

Algebraic and graph-theoretic properties of infinite n-posets

A Σ-labeled n-poset is an (at most) countable set, labeled in the set Σ, equipped with n partial orders. The collection of all Σ-labeled n-posets is naturally equipped with n binary product operations and n ω-ary product operations. Moreover, the ω-ary product operations give rise to n ω-power operations. We show that those Σ-labeled n-posets that can be generated from the singletons by the bin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Manufacturing

سال: 2015

ISSN: 2351-9789

DOI: 10.1016/j.promfg.2015.09.025